#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}


int T, n;
string s;

inline void solution() {
    cin >> T;
    while (T -- ) {
        cin >> n >> s;
        map<pair<int, int>, int> mp;
        mp[mk(0, 0)] = 1;
        int x = 0, y = 0;
        LL res = 0;
        for (int i = 0; i < n; i ++ ) {
            if (s[i] == 'U') y ++;
            else if (s[i] == 'D') y -- ;
            else if (s[i] == 'L') x -- ;
            else x ++ ;
            if (mp.find(mk(y, x)) != mp.end())
                res += mp[mk(y, x)];
            mp[mk(y, x)] ++ ;
        }
        cout << res << endl;
    }
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}